Boolean constant degree functions on the slice are juntas
نویسندگان
چکیده
We show that a Boolean degree d function on the slice ([n] k ) = {(x1, . . . , xn) ∈ {0, 1} : ∑n i=1 xi = k} is a junta, assuming that k, n − k are large enough. This generalizes a classical result of Nisan and Szegedy on the hypercube. Moreover, we show that the maximum number of coordinates that a Boolean degree d function can depend on is the same on the slice and the hypercube.
منابع مشابه
Low degree almost Boolean functions are sparse juntas
Nisan and Szegedy showed that low degree Boolean functions are juntas. Kindler and Safra showed that low degree functions which are almost Boolean are close to juntas. Their result holds with respect to μp for every constant p. When p is allowed to be very small, new phenomena emerge. For example, the function y1 + · · · + yε/p (where yi ∈ {0, 1}) is close to Boolean but not close to a junta. W...
متن کاملLearning symmetric k-juntas in time n
We give an algorithm for learning symmetric k-juntas (boolean functions of n boolean variables which depend only on an unknown set of k of these variables) in the PAC model under the uniform distribution, which runs in time n log . Our bound is obtained by proving the following result: Every symmetric boolean function on k variables, except for the parity and the constant functions, has a non-z...
متن کاملNoise-Resistant Boolean-Functions are Juntas
We consider Boolean functions over n binary variables, and a general p-biased, product measure over the inputs. We show that if f is of low-degree, that is, so that the weight of f on the Fourier-Walsh products of size larger than k is small, then f is close to a junta, namely, a function which depends only on very small, related to k however unrelated to n, number of variables. We conclude tha...
متن کاملOn the Fourier spectrum of symmetric Boolean functions
We study the following question: What is the smallest t such that every symmetric boolean function on k variables (which is not a constant or a parity function), has a non-zero Fourier coefficient of order at least 1 and at most t? We exclude the constant functions for which there is no such t and the parity functions for which t has to be k. Let τ(k) be the smallest such t. Our main result is ...
متن کاملNearly Tight Bounds on $\ell_1$ Approximation of Self-Bounding Functions
We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube {0, 1}n. Informally, a function f : {0, 1}n → R is self-bounding if for every x ∈ {0, 1}n, f(x) upper bounds the sum of all the n marginal decreases in the value of the function at x. Self-bounding functions include such well-known classes of functions as submo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1801.06338 شماره
صفحات -
تاریخ انتشار 2018